Entanglement-Assisted Quantum Convolutional Coding

نویسندگان

  • Mark M. Wilde
  • Todd A. Brun
چکیده

We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglement-assisted quantum convolutional coding. Our construction produces a Calderbank-Shor-Steane (CSS) entanglement-assisted quantum convolutional code from two arbitrary classical binary convolutional codes. The rate and error-correcting properties of the classical convolutional codes directly determine the corresponding properties of the resulting entanglement-assisted quantum convolutional code. We explain how to encode our CSS entanglement-assisted quantum convolutional codes starting from a stream of information qubits, ancilla qubits, and shared entangled bits.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Convolutional Coding

We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglementassisted quantum convolutional coding. Our construction produces a Calderbank-Shor-Steane (CSS) entanglement-assisted quantum convolutional code from two arbitrary class...

متن کامل

Quantum Convolutional Coding with Shared Entanglement: General Structure

Abstract—We present a general theory of entanglementassisted quantum convolutional coding. The codes have a convolutional or memory structure, they assume that the sender and receiver share noiseless entanglement prior to quantum communication, and they are not restricted to possess the CalderbankShor-Steane structure as in previous work. We provide two significant advances for quantum convolut...

متن کامل

Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels

We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In this way, we obtain single-letter characterizations of the entanglement-assisted classical capacities for both channel models. Moreover, we show that the ent...

متن کامل

Philosophical Aspects of Quantum Information Theory

2 First steps with quantum information 3 2.1 Bits and qubits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 The no-cloning theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Quantum cryptography . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.3.1 Key Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.4 Entanglement-as...

متن کامل

Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication

Bennett et al. showed that allowing shared entanglement between a sender and receiver before communication begins dramatically simplifies the theory of quantum channels, and these results suggest that it would be worthwhile to study other scenarios for entanglement-assisted classical communication. In this vein, the present paper makes several contributions to the theory of entanglement-assiste...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0712.2223  شماره 

صفحات  -

تاریخ انتشار 2007